Analytic perturbation of Sylvester and Lyapunov matrix equations

نویسندگان

  • Konstantin E. Avrachenkov
  • Jean B. Lasserre
چکیده

We consider an analytic perturbation of the Sylvester matrix equation. Mainly we are interested in the singular case, that is, when the null space of the unperturbed Sylvester operator is not trivial, but the perturbed equation has a unique solution. In this case, the solution of the perturbed equation can be given in terms of a Laurent series. Here we provide a necessary and su cient condition for the existence of a Laurent series with a rst order pole. An e cient recursive procedure for the calculation of the Laurent series' coe cients is given. Finally, we show that in the particular, but practically important case of semisimple eigenvalues, the recursive procedure can be written in a compact matrix form.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

Master ’ s Thesis Proposal , 20 credits : ScaLAPACK - style algorithms for Periodic Matrix Equations

1 Motivation This Master's Thesis project considers software for solving periodic Sylvester-type matrix equations. Recently, the ScaLAPACK-style library SCASY was completed. SCASY is a parallel HPC software library that solves for 42 sign and transpose variant of 8 common standard and generalized Sylvester-type matrix equations (see Table 1) which builds on the Table 1: The Sylvester-type matri...

متن کامل

Low - Rank Solution Methods for Large - Scale Linear Matrix Equations

LOW-RANK SOLUTION METHODS FOR LARGE-SCALE LINEAR MATRIX EQUATIONS Stephen D. Shank DOCTOR OF PHILOSOPHY Temple University, May, 2014 Professor Daniel B. Szyld, Chair We consider low-rank solution methods for certain classes of large-scale linear matrix equations. Our aim is to adapt existing low-rank solution methods based on standard, extended and rational Krylov subspaces to solve equations w...

متن کامل

An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations

‎In this paper‎, ‎an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed‎. ‎The convergence analysis of the algorithm is investigated‎. ‎We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions‎. ‎Finally‎, ‎some numerical examples are given to demons...

متن کامل

Gauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations

In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000